binary goppa code造句
例句與造句
- They should not be confused with Binary Goppa codes that are used, for instance, in the McEliece cryptosystem.
- Barreto et al . recommend using a binary Goppa code of length at least n = 3307 and dimension at least k = 2515, and capable of correcting t = 66 errors.
- Decoding of binary Goppa codes is traditionally done by Patterson algorithm, which gives good error-correcting capability ( it corrects all t design errors ), and is also fairly simple to implement.
- Binary Goppa codes viewed as a special case of Goppa codes have the interesting property that they correct full \ deg ( g ) errors, while only \ deg ( g ) / 2 errors in ternary and all other cases.
- A binary Goppa code is defined by a polynomial g ( x ) of degree t over a finite field GF ( 2 ^ m ) without multiple zeros, and a sequence L of n distinct elements from GF ( 2 ^ m ) that aren't roots of the polynomial:
- It's difficult to find binary goppa code in a sentence. 用binary goppa code造句挺難的
- Because of the high error correction capacity compared to code rate and form of parity-check matrix ( which is usually hardly distinguishable from a random binary matrix of full rank ), the binary Goppa codes are used in several post-quantum cryptosystems, notably McEliece cryptosystem and Niederreiter cryptosystem.
- For practical purposes, parity-check matrix of a binary Goppa code is usually converted to a more computer-friendly binary form by a trace construction, that converts the t-by-n matrix over GF ( 2 ^ m ) to a mt-by-n binary matrix by writing polynomial coefficients of GF ( 2 ^ m ) elements on m successive rows.